An assertional correctness proof of a distributed algorithm
نویسندگان
چکیده
منابع مشابه
An Assertional Proof of Rana's Algorithm
We give an assertional correctness proof for a version of Rana's termination detection algorithm. Safety is shown by means of reasoning with invariants, and liveness by means of a norm function, whose value decreases with every step of the detection algorithm.
متن کاملAn O(n) Distributed Deadlock Resolution Algorithm: Correctness Proof
This paper shows a new distributed algorithm for deadlock detection and resolution under the single-resource request model that highly improves the complexity measurements of previous proposals. The algorithm has a communication cost of 2n − 1 messages and a latency of n ·T for a deadlock cycle of n processes, where T is the inter-site communication delay. The algorithm achieves this improvemen...
متن کاملProof of correctness of QueryPIE closure algorithm∗
In QueryPIE, the ti-reasoner algorithm is the one responsible to calculate the inferred results of a particular query requested from the user. Conceptually, the only difference between ti-reasoner (reported in Algorithm 1) and traditional backward-chaining is that ti-reasoner does not perform recursive inference on patterns which are more specific than terminological patterns. If the knowledge ...
متن کاملA Semiformal Correctness Proof of a Network Broadcast Algorithm
In past years, a l q g e number of published distributed algorithms have been shown to be incorrect. Unfortunately, designers of distributed algorithms typically use informal correctness proofs, which tend to be unreliable. Formal correctness proofs offer a much higher degree of reliability, but they are not popular among algorithm designers because they are too mathematical and they typically ...
متن کاملModelling a Distributed Cached Store for Garbage Collection: The Algorithm and Its Correctness Proof
Caching and persistence support efficient, convenient and transparent distributed data sharing. The most natural model of persistence is persistence by reachability, managed automatically by a garbage collector (GC). We propose a very general model of such a system (based on distributed shared memory) and a scalable, asynchronous distributed GC algorithm. Within this model, we show sufficient a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1982
ISSN: 0167-6423
DOI: 10.1016/0167-6423(83)90014-x